On the Hardness of Almost-Sure Termination
نویسندگان
چکیده
This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost–sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is Σ 1– and Σ 0 2–complete, respectively. Deciding (universal) almost–sure termination as well as deciding whether the expected outcome of a program equals a given rational value is shown to be Π 2–complete. Finally, it is shown that deciding (universal) positive almost–sure termination is Σ 2–complete (Π 0 3–complete).
منابع مشابه
Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard
This paper considers the computational hardness of computing expected outcomes and deciding almost–sure termination of probabilistic programs. We show that deciding almost–sure termination and deciding whether the expected outcome of a program equals a given rational value is Π2–complete. Computing lower and upper bounds on the expected outcome is shown to be recursively enumerable and Σ2–compl...
متن کاملON THE ALMOSTLY SURE CONVERGENCE OF THE SEQUENCE D_P,Q
In this paper, we will discuss the concept of almost sure convergence for specic groups of fuzzyrandom variables. For this purpose, we use the type of generalized Chebyshev inequalities.Moreover, we show the concept of almost sure convergence of weighted average pairwise NQDof fuzzy random variables.
متن کاملThe Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables
In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...
متن کاملBeyond Almost-Sure Termination
The aim of this paper is to argue that models in cognitive science based on probabilistic computation should not be restricted to those procedures that almost surely (with probability 1) terminate. There are several reasons to consider nonterminating procedures as candidate components of cognitive models. One theoretical reason is that there is a perfect correspondence between the enumerable se...
متن کاملAlmost sure exponential stability of stochastic reaction diffusion systems with Markovian jump
The stochastic reaction diffusion systems may suffer sudden shocks, in order to explain this phenomena, we use Markovian jumps to model stochastic reaction diffusion systems. In this paper, we are interested in almost sure exponential stability of stochastic reaction diffusion systems with Markovian jumps. Under some reasonable conditions, we show that the trivial solution of stocha...
متن کامل